Incomplete descriptions in Raymond’s Secret Agent X-9
نویسندگان
چکیده
منابع مشابه
Essentially Incomplete Descriptions
In this paper I offer a defence of a Russellian analysis of the referential uses of incomplete (mis) descriptions, in a contextual setting. With regard to descriptions (introduction), I will support the former against the latter. In 1. I explain what I mean by “essentially” incomplete descriptions: incomplete descriptions are context dependent descriptions. In 2. I examine one of the best versi...
متن کاملEfficient Diagnosis based on Incomplete System Descriptions
Fault diagnosis is an important task in technical domains. In the model–based diagnosis literature it has mostly been assumed that technical systems are described by complete, deterministic system descriptions. We show that intuitive descriptions of technical systems are often incomplete, and need to be completed for providing correct diagnoses. Due to the structure of the axioms of such system...
متن کاملIncomplete Definite Descriptions, Demonstrative Completion and Redundancy
“Incomplete” definite descriptions (i.e. descriptions that violate the uniqueness constraint) have been offered various accounts in semantics. Among them, the so-called ellipsis account, which analyzes “the F” as elliptical for “the F which is that F”. I begin by arguing that the objections raised against this account have not been conclusive, and go on to supply a new argument against it, whic...
متن کاملContinuous Plan Evaluation with Incomplete Action Descriptions
In complex environments, a planning system may be faced with incomplete information about both the planning operators and the state of the world. Previous research has investigated policies for selecting the best plan to execute, given incomplete operator descriptions. This paper extends that work to support interleaved planning and execution by taking into account past and current sensor readi...
متن کاملAn incomplete set of shortest descriptions
The truth-table degree of the set of shortest programs remains an outstanding problem in recursion theory. We examine two related sets, the set of shortest descriptions and the set of domain-random strings, and show that the truth-table degrees of these sets depend on the underlying acceptable numbering. We achieve some additional properties for the truth-table incomplete versions of these sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Volume 3
سال: 2013
ISSN: 2048-0792
DOI: 10.5334/cg.ae